Local Extremes, Runs, Strings and Multiresolution
نویسندگان
چکیده
منابع مشابه
Inferring Strings from Runs
A run in a string is a nonextendable periodic substring in the string. Detecting all runs in a string is important and studied both from theoretical and practical points of view. In this paper, we consider the reverse problem of it. We reveal that the time complexity depends on the alphabet size k of the string to be output. We show that it is solvable in polynomial time for both binary alphabe...
متن کاملBinary Strings Without Odd Runs of Zeros
We look at binary strings of length n which contain no odd run of zeros and express the total number of such strings, the number of zeros, the number of ones, the total number of runs, and the number of levels, rises and drops as functions of the Fibonacci and Lucas numbers and also give their generating functions. Furthermore, we look at the decimal value of the sum of all binary strings of le...
متن کاملNot So Many Runs in Strings
Since the work of Kolpakov and Kucherov in [5, 6], it is known that ρ(n), the maximal number of runs in a string, is linear in the length n of the string. A lower bound of 3/(1 + √ 5)n ∼ 0.927n has been given by Franek and al. [3, 4], and upper bounds have been recently provided by Rytter, Puglisi and al., and Crochemore and Ilie (1.6n) [8, 7, 1]. However, very few properties are known for the ...
متن کاملP-term Strings and Semi-local Strings
P-term potentials can give rise to Nielsen-Olesen or semi-local cosmic strings. We present a general analysis of these cosmic strings where we derive the Bogomol’nyi equations and field profiles for both types of string and discuss their stability. We give an analysis of the fermionic zero modes that could live on the strings and a brief discussion of the inflationary period preceding their for...
متن کاملNew Simple Efficient Algorithms Computing Powers and Runs in Strings
Three new simple O(n log n) time algorithms related to repeating factors are presented in the paper. The first two algorithms employ only a basic textual data structure called the Dictionary of Basic Factors. Despite their simplicity these algorithms not only detect existence of powers but also find all primitively rooted cubes (as well as higher powers) and all cubic runs. Our third O(n log n)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 2001
ISSN: 0090-5364
DOI: 10.1214/aos/996986501